Quicksort with Unreliable Comparisons: A Probabilistic Analysis
نویسندگان
چکیده
منابع مشابه
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
متن کاملSorting with Unreliable Comparisons: a Probabilistic Analysis
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
متن کاملProbabilistic Analysis of the Dual-Pivot Quicksort "Count"
Recently, Aumüller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called “Count”, which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further probabilistic analysis of “Count”. We derive an exact formula for the average number of swaps needed by “Count” as well as an asymptotic formula for the varia...
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کاملMonte Carlo Sort for unreliable human comparisons
Algorithms which sort lists of real numbers into ascending order have been studied for decades. They are typically based on a series of pairwise comparisons and run entirely ’on chip’. However people routinely sort lists which depend on subjective or complex judgements that cannot be automated. Examples include marketing research; where surveys are used to learn about customer preferences for p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2004
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548304006297